linTAP : A Tableau Prover for Linear Logi

linTAP: A Tableau Prover for Linear Logic

linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an analytic tableau and ensures the linear validity using prefix unification. We present the tableau calculus used by linTAP, an algorithm for prefix unification in linear logic, the linTAP implementation, and some experimental result...

Accelerating Tableaux Proofs Using Compact Representations

In this article a modiied form of tableau calculus, called Tableau Graph Calculus, is presented for overcoming the well-known ineeciencies of the traditional tableau calculus to a large extent. This calculus is based on a compact representation of analytic tableaux by using graph structures called tableau graphs. These graphs are obtained from the input formula in linear time and incorporate mo...

Towards a Wide-Coverage Tableau Method for Natural Logic

The first step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected tableau rules are presented and their usage is also exemplified in several tableau proofs. The perf...

A Tableau Cal ulus for Temporal Des ription Logi : TheConstant Domain Case

Synthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics

This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...